#include"sort.h"
void prime_test()
{
	int arr[101] = { 0 };
	int i = 0;
	for (i = 0; i <= 100; i++)
	{
		arr[i] = i + 100;
	}
	for (i = 0; i <= 100; i++)
	{
		int j = 0;
		for (j = 2; j < arr[i]; j++)
		{
			if (arr[i] % j == 0)
				break;
		}
		if(j==arr[i])
		printf("%d ", arr[i]);
	}
}


int main()
{
	int a[] = { 10,6,7,1,3,9,4,2, };
	int arr[] = { 10,2,9,5,3,4,7,6,1,8 };
	int arr1[] = { 6,1,2,7,9,3,4,5,10,8 };
	//InsertSort(arr, sizeof(arr) / sizeof(arr[0]));
	//ShellSort(arr, sizeof(arr) / sizeof(arr[0]));
	//SelectSort(arr, sizeof(arr) / sizeof(arr[0]));
	//HeapSort(arr, sizeof(arr) / sizeof(arr[0]));
	
	//BubbleSort(arr, sizeof(arr) / sizeof(arr[0]));
	//QuickSort(arr1, 0, sizeof(arr) / sizeof(arr[0])-1);
	//QuickSortPlus(arr1, 0, 9);
	//MergeSort(arr1, sizeof(arr) / sizeof(arr[0]));
	//MergeSortNonR(arr1, sizeof(arr) / sizeof(arr[0]));
	//MergeSortNonR(a, sizeof(a) / sizeof(a[0]));
	CountSort(a, sizeof(a) / sizeof(a[0]));
	PrintArr( a, sizeof(a)/sizeof(a[0]));
	return 0;
}


